Minimum Latency Tours and the k-Traveling Repairmen Problem
نویسندگان
چکیده
منابع مشابه
Paths, Trees, and Minimum Latency Tours
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591-approximation to the minimum latency problem, improving on previous algorithms by a multiplicative factor of 2. Our techniques also give similar improvements for related problems like k-traveling repairmen and its multiple depot variant. We also observe that standard techniqu...
متن کاملApproximating the k-traveling repairman problem with repairtimes
Given an undirected graph G= (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starting at s and together covering all the vertices (customers) such that the sum of the latencies experienced by the customers is minimum. Latency of a customer p is defined to be the distance traveled (time elapsed) before v...
متن کاملA Review on Traveling Repairman Problem
Suppose G=(V,A) be an undirected graph with n nodes and a source vertex s Є V. Each node has a problem that must be solved by the repairman that has send. We are given the time required by the repairman to travel among nodes. The objective is to find a tour that minimizes the total waiting time of all the problems that are waiting to be solved. Traveling Repairman problem (TRP) is also known as...
متن کاملA Population Based ACO Algorithm for the Combined Tours TSP Problem
In this paper we apply a Population based Ant Colony Optimization (PACO) algorithm for solving the following new version of the Traveling Salesperson problem that is called the Combined Tours TSP (CT-TSP). Given are a set of cities, for each pair of cities a cost function and an integer k. The aim is to find a set of k (cyclic) tours, i.e., each city is contained exactly once in each tour and e...
متن کاملMarkov Chain Anticipation for the Online Traveling Salesman Problem by Simulated Annealing Algorithm
The arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. The policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. In on-line created tours arc costs are not available for decision makers. The on-line traversed nodes are f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004